Error detection by binary sparse matrices
نویسندگان
چکیده
منابع مشابه
Compressed Sensing with Sparse Binary Matrices: Instance Optimal Error Guarantees in Near-Optimal Time
A compressed sensing method consists of a rectangular measurement matrix, M ∈ R m×N with m ≪ N , together with an associated recovery algorithm, A : R → R . Compressed sensing methods aim to construct a high quality approximation to any given input vector x ∈ R using onlyMx ∈ R as input. In particular, we focus herein on instance optimal nonlinear approximation error bounds for M and A of the f...
متن کاملDeterministic construction of sparse binary and ternary matrices from existing binary sensing matrices
In the present work, we discuss a procedure for constructing sparse binary and ternary matrices from existing two binary sensing matrices. The matrices that we construct have several attractive properties such as smaller density, which supports algorithms with low computational complexity. As an application of our method, we show that a CS matrix of general row size different from p, p, pq (for...
متن کاملTechnique detection software for Sparse Matrices
Sparse storage formats are techniques for storing and processing the sparse matrix data efficiently. The performance of these storage formats depend upon the distribution of non-zeros, within the matrix in different dimensions. In order to have better results we need a technique that suits best the organization of data in a particular matrix. So the decision of selecting a better technique is t...
متن کاملApproximating sparse binary matrices in the cut-norm
The cut-norm ||A||C of a real matrix A = (aij)i∈R,j∈S is the maximum, over all I ⊂ R, J ⊂ S of the quantity | ∑ i∈I,j∈J aij |. We show that there is an absolute positive constant c so that if A is the n by n identity matrix and B is a real n by n matrix satisfying ||A−B||C ≤ 1 16 ||A||C , then rank(B) ≥ cn. Extensions to denser binary matrices are considered as well.
متن کاملCapacity Achieving Linear Codes with Random Binary Sparse Generating Matrices
In this paper, we prove the existence of capacity achieving linear codes with random binary sparse generating matrices. The results on the existence of capacity achieving linear codes in the literature are limited to the random binary codes with equal probability generating matrix elements and sparse parity-check matrices. Moreover, the codes with sparse generating matrices reported in the lite...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics: Conference Series
سال: 2010
ISSN: 1742-6596
DOI: 10.1088/1742-6596/233/1/012017